Solving Planning Problems Using Real-Time Model Checking (Translating PDDL3 into Timed Automata)
نویسندگان
چکیده
We present a translation for the variant PDDL 3 of PDDL (Planning Domain Definition Language) into Timed Automata. The advantage of having such a translation is the availability of tool support by modelcheckers. We present a case study in which we apply a version of UPPAAL that has been extended for the search of cost-optimal solutions.
منابع مشابه
Mapping Temporal Planning Constraints into Timed Automata
Planning and Model Checking are similar in concept. They both deal with reaching a goal state from an initial state by applying specified rules that allow for the transition from one state to another. Exploring the relationship between them is an interesting new research area. We are interested in planning frameworks that combine both planning and scheduling. For that, we focus our attention on...
متن کاملCompiling Timed Algebras into Timed Automata
Real-time systems are hard to model, specify and design. It is common practice today to pass from informal speciications to implementations and then test the behavior of the system on some cases, which is inadequate to develop bug-free real-time systems. To ensure correctness we need to employ automatic veriication methods and tools. The following real-time software development process has been...
متن کاملUppaal | a Tool Suite for Automatic Veriication of Real{time Systems ?
Uppaal is a tool suite for automatic veriication of safety and bounded liveness properties of real-time systems modeled as networks of timed automata. It includes: a graphical interface that supports graphi-cal and textual representations of networks of timed automata, and automatic transformation from graphical representations to textual format, a compiler that transforms a certain class of li...
متن کاملAutomatic Verification of Real–Time Systems
Uppaal is a tool suite for automatic veriication of safety and bounded liveness properties of real-time systems modeled as networks of timed automata. It includes: a graphical interface that supports graphi-cal and textual representations of networks of timed automata, and automatic transformation from graphical representations to textual format, a compiler that transforms a certain class of li...
متن کاملOn Checking Timed Automata for Linear Duration Invariants
In this work, we address the problem of verifying a Timed Automaton for a real-time property written in Duration Calculus in the form of Linear Duration Invariants. We present a conservative method for solving the problem using the linear programming techniques. First, we provide a procedure to translate Timed Automata to a sort of regular expressions for timed languages. Then, we extend the li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002